Convergence of a Random Particle Method to Solutions of the Kolmogorov Equation
نویسندگان
چکیده
We study a random particle method for solving the reaction-diffusion equation U( = uuxx+f(u) which is a one-dimensional analogue of the random vortex method. It is a fractional step method in which m = vuxx is solved by random walking the particles while ut = f(u) is solved with a numerical ordinary differential equation solver such as Euler's method. We prove that the method converges when f(u) = u(l i¿), i.e. the Kolmogorov equation, and that when the time step Ai is 0( y/Ñ ) the rate of convergence is like In N ■ y/Ñ where N denotes the number of particles. Furthermore, we show that this rate of convergence is uniform as the diffusion coefficient u tends to 0. Thus, travelling waves with arbitrarily steep wavefronts may be modeled without an increase in the computational cost. We also present the results of numerical experiments including the use of second-order time discretization and second-order operator splitting and use these results to estimate the expected value and standard deviation of the error.
منابع مشابه
Analytical Investigation of Jeffery-hamel Fow with High Magnetic Field and Nano Particle by RVIM
Many researchers have been interested in application of mathematical methods to find analytical solutions of nonlinear equations and for this purpose, new methods have been developed. One of the newest analytical methods to solve nonlinear equations is Reconstruction of variational Iteration Method (RVIM) which is an accurate and a rapid convergence method in finding the approximate solution fo...
متن کاملSolving random inverse heat conduction problems using PSO and genetic algorithms
The main purpose of this paper is to solve an inverse random differential equation problem using evolutionary algorithms. Particle Swarm Algorithm and Genetic Algorithm are two algorithms that are used in this paper. In this paper, we solve the inverse problem by solving the inverse random differential equation using Crank-Nicholson's method. Then, using the particle swarm optimization algorith...
متن کاملPareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملConvergence of Numerical Method For the Solution of Nonlinear Delay Volterra Integral Equations
In this paper, Solvability nonlinear Volterra integral equations with general vanishing delays is stated. So far sinc methods for approximating the solutions of Volterra integral equations have received considerable attention mainly due to their high accuracy. These approximations converge rapidly to the exact solutions as number sinc points increases. Here the numerical solution of nonlinear...
متن کاملOn the convergence of solutions to a difference inclusion on Hadamard manifolds
The aim of this paper is to study the convergence of solutions of the following second order difference inclusion begin{equation*}begin{cases}exp^{-1}_{u_i}u_{i+1}+theta_i exp^{-1}_{u_i}u_{i-1} in c_iA(u_i),quad igeqslant 1\ u_0=xin M, quad underset{igeqslant 0}{sup} d(u_i,x)
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010